Mixing Index by Coordination Number for Mixture of Particles with Uniform Size
نویسندگان
چکیده
منابع مشابه
Uniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Size distribution and mixing state of BC particles in Shanghai
Introduction Conclusions References
متن کاملThe degree, size and chromatic index of a uniform hypergraph
Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every > 0, if D is sufficiently large as a function of t, k and , then the chromatic index of H is at most (t − 1 + 1/t + )D. We prove this conjecture for the special case of intersecting hypergraphs in the following stronger form:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Research Association of Powder Technology, Japan
سال: 1971
ISSN: 1883-8766
DOI: 10.4164/sptj1964.8.321